Enzyme genetic programming : modelling biological evolvability in genetic programming
نویسنده
چکیده
This thesis introduces a new approach to program representation in genetic programming in which interactions between program components are expressed in terms of a component’s behaviour rather through its relative position within a representation or through other non-behavioural systems of reference. This approach has the advantage that a component’s behaviour is expressed in a way that is independent of any particular program it finds itself within; and thereby overcomes the problem when using conventional program representations whereby program components lose their behavioural context following recombination. More generally, this implicit context representation leads to a process of meaningful variation filtering; whereby inappropriate change induced by variation operators can be wholly or partially ignored. This occurs as a consequence of program behaviours emerging from the self-organisation of program components, ignoring those components which do not fit the contexts declared by the other components within the program. This process results in gradual change within the behaviour of a program during evolution. This thesis also presents results which show that implicit context representation leads to better size evolution characteristics than conventional genetic programming; and that functional redundancy and Lamarckian reinforcement learning both improve evolutionary search, agreeing with previous research by other authors.
منابع مشابه
Modelling biological evolvability: implicit context and variation filtering in enzyme genetic programming.
This paper describes recent insights into the role of implicit context within the representations of evolving artefacts and specifically within the program representation used by enzyme genetic programming. Implicit context occurs within self-organising systems where a component's connectivity is both determined implicitly by its own definition and is specified in terms of the behavioural conte...
متن کاملModelling Evolvability in Genetic Programming
We develop a tree-based genetic programming system capable of modelling evolvability during evolution through machine learning algorithms, and exploiting those models to increase the efficiency and final fitness. Existing methods of determining evolvability require too much computational time to be effective in any practical sense. By being able to model evolvability instead, computational time...
متن کاملBiomimetic Representation in Genetic Programming
Biological representations underly biological evolution. Moreover, they are also a product of evolution and consequently well adapted for their purpose. The argument presented in this paper is that the representations of biology are also suitable for representing artificial executable systems in genetic programming and, furthermore, that biomimetic representations could improve both the adaptab...
متن کاملThe Evolution of Evolvability in Genetic Programming
The notion of “evolvability” — the ability of a population to produce variants fitter than any yet existing — is developed as it applies to genetic algorithms. A theoretical analysis of the dynamics of genetic programming predicts the existence of a novel, emergent selection phenomenon: the evolution of evolvability. This is produced by the proliferation, within programs, of blocks of code that...
متن کاملBankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach
In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003